Quantifier Elimination for Quartics
نویسندگان
چکیده
Concerning quartics, two particular quantifier elimination (QE) problems of historical interests and practical values are studied. We solve the problems by the theory of complete discrimination systems and negative root discriminant sequences for polynomials that provide a method for real (positive/negative) and complex root classification for polynomials. The equivalent quantifier-free formulas are obtained mainly be hand and are simpler than those obtained automatically by previous methods or QE tools. Also, applications of the results to program verification and determination of positivity of symmetric polynomials are showed.
منابع مشابه
Real Quantifier Elimination in the RegularChains Library
Quantifier elimination (QE) over real closed fields has found numerous applications. Cylindrical algebraic decomposition (CAD) is one of the main tools for handling quantifier elimination of nonlinear input formulas. Despite of its worst case doubly exponential complexity, CAD-based quantifier elimination remains interesting for handling general quantified formulas and producing simple quantifi...
متن کاملQuantifier Elimination in Term Algebras The Case of Finite Languages
We give a quantifier elimination procedure for term algebras over suitably expanded finite first-order languages. Our expansion is purely functional. Our method works by substituting finitely many parametric test terms. This allows us to obtain in addition sample solutions for an outermost existential quantifier block. The existence of our method implies that the considered quantifier eliminati...
متن کاملElimination of Variables In Parallel
where , the existential quantifier, denotes “there exists’’ and is the conjunction that denotes “and.’’ Notice that while both sides of the equivalence, , are in fact equivalent, the right hand side does not involve y, i.e., the variable y has been eliminated. In fact, the quantifier has been also eliminated; for this reason, the procedure is also called “quantifier elimination.’’ A serious def...
متن کاملVerifying Mixed Real-Integer Quantifier Elimination
We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a work by Weispfenning. To this end we provide two verified quantifier elimination procedures: for Presburger arithmitics and for linear real arithmetics.
متن کاملQuantifier elimination for the theory of algebraically closed valued fields with analytic structure
The theory of algebraically closed non-Archimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this paper and which has far reaching consequences in the geometry of definable sets. This method of proving quantifier ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006